Binary Programming Techniques for Linear Metamaterial Design Optimization

نویسندگان

  • J. Saa-Seoane
  • N.-C. Nguyen
  • H. Men
  • R. Freund
  • J. Peraire
چکیده

The design of metamaterials is currently a fertile research domain. However, most of the metamaterial designs described in the literature arise from physical intuition, and often assume infinite periodicity. There is therefore a need for a design methodology capable of computing patterns and designs involving two different materials where the underlying design variables correspond to a finite set of pixels in a 2-dimensional mesh, and where the goal is a design with prescribed metamaterial properties. This naturally leads to the consideration of binary optimization models in contrast to classical (continuous) gradient-based methods which generically provide continuous solutions that then need to be “rounded” to binary values. While the potential drawback of binary optimization is that its computational complexity is usually NP-hard and hence theoretically unattractive, we show herein that binary optimization combined with a reduced basis approach can relatively efficiently produce very good solutions to metamaterial design problems of interest.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Binary Optimization Method for Linear Metamaterial Design Optimization

The design of metamaterials is currently a fertile research domain. However, most of the metamaterial designs described in the literature arise from physical intuition, and often assume infinite periodicity. There is therefore a need for a design methodology capable of computing patterns and designs involving two different materials where the underlying design variables correspond to a finite s...

متن کامل

A Mathematical Optimization Model for Solving Minimum Ordering Problem with Constraint Analysis and some Generalizations

In this paper, a mathematical method is proposed to formulate a generalized ordering problem. This model is formed as a linear optimization model in which some variables are binary. The constraints of the problem have been analyzed with the emphasis on the assessment of their importance in the formulation. On the one hand, these constraints enforce conditions on an arbitrary subgraph and then g...

متن کامل

An Exact Penalty Method for Binary Optimization Based on MPEC Formulation

Binary optimization is a central problem in mathematical optimization and its applications are abundant. To solve this problem, we propose a new class of continuous optimization techniques, which is based on Mathematical Programming with Equilibrium Constraints (MPECs). We first reformulate the binary program as an equivalent augmented biconvex optimization problem with a bilinear equality cons...

متن کامل

Effects of Probability Function on the Performance of Stochastic Programming

Stochastic programming is a valuable optimization tool where used when some or all of the design parameters of an optimization problem are defined by stochastic variables rather than by deterministic quantities. Depending on the nature of equations involved in the problem, a stochastic optimization problem is called a stochastic linear or nonlinear programming problem. In this paper,a stochasti...

متن کامل

Design of single-sampling inspection-plan approach by mathematical programming and linear assignment method

This study proposes a new approach for single-sampling plan by determining sample size and acceptance number. The proposed approach is based on a two-step methodology. In the first step: quality management step, different single sampling inspection plans were generated by running an optimization model for different possible acceptance numbers. While, in the second step: Multi-Attribute Decision...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012